Covert Communication Over the Poisson Channel

We consider the problem of communication over a continuous-time Poisson channel subject to covertness constraint: The relative entropy between output distributions when message is transmitted and no input provided must be small. In absence both bandwidth peak-power constraints, we show covert capacity this channel, in nats per second, infinity. When constraint imposed on input, becomes zero, “square-root scaling law” applies. but imposed, again shown have not determined whether square-root law holds or not.